Polynomial Charts For Totally Unordered Languages
نویسنده
چکیده
Totally unordered or discontinuous composition blows up chart size on most setups. This paper analyzes the effects of total unordering to type 2 grammars and simple attribute-value grammars (sAVGs). In both cases, charts turn exponential in size. It is shown that the k-ambiguity constraint turns charts polynomial, even for s-AVGs. Consequently, tractable parsing can be deviced.
منابع مشابه
The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints
We study the membership problem for regular expressions extended with operators for unordered concatenation and numerical constraints. The unordered concatenation of a set of regular expressions denotes all sequences consisting of exactly one word denoted by each of the expressions. Numerical constraints are an extension of regular expressions used in many applications, e.g. text search (e.g., ...
متن کاملPolynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to extract meaningful and hidden knowledge from such tree structured documents, we consider a minimal language (MINL) problem for term trees. The MINL problem for term trees is to find a term tree t such that the language...
متن کاملCompressed Tree Canonization
Straight-line (linear) context-free tree (SLT) grammars have been used to compactly represent ordered trees. Equivalence of SLT grammars is decidable in polynomial time. Here we extend this result and show that isomorphism of unordered trees given as SLT grammars is decidable in polynomial time. The result generalizes to isomorphism of unrooted trees and bisimulation equivalence. For non-linear...
متن کاملcient Learning of Semi - structured Data from Queries
This paper studies the polynomial-time learnability of the classes of ordered gapped tree patterns (OGT) and ordered gapped forests (OGF) under the into-matching semantics in the query learning model of Angluin. The class OGT is a model of semi-structured database query languages, and a generalization of both the class of ordered/unordered tree pattern languages and the class of non-erasing reg...
متن کاملXML schemas without order
XML schemas consist of context-free grammars that allow regular expressions on the right-hand side of productions. In the schema definition language ScmDL, XML schemas are enhanced to, among other things, mark nodes as ordered or as unordered. An unordered node is then derived by a production with a regular expression r if the string induced by its children belongs to the symmetric closure of r...
متن کامل